Implementing belief function computations

نویسندگان

Rolf Haenni

Norbert Lehmann

چکیده

This papers discusses several implementation aspects for Dempster-Shafer belief functions. The main objective is to propose an appropriate representation of mass functions and efficient data structures and algorithms for the two basic operations of combination and marginalization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Tripartite Architecture based on Referee Function for Generic Implementations of Evidence Combination Rules

Abstract:An approach for a generic implementation of combination rules of evidence is proposed. This approach implies a tripartite architecture, with respective parts implementing the logical framework (complete distributive lattice, Boolean algebra), the combination definition (referee function), and the belief-related processes (basic belief assignment, belief and plausibility computation, co...

متن کامل

BeliefNet Tool : An Evidential Network Toolbox for Matlab

The BeliefNet Tool is a new engine to perform local computations efficiently and conveniently in both undirected and directed evidential networks (i.e. networks using belief functions theory [10], [12]). BeliefNet Tool is written in Matlab and it implements the basic algorithms as well as the main operations performing inference of beliefs in evidential networks. Attention is especially devoted...

متن کامل

On Structured Belief Bases -

In this paper some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. Some notions of relatedness are deened. We then show how this extra structure can be used for implementing local change as deened in HW98].

متن کامل